5

A note on the descriptive complexity of maximization problems

Year:
1993
Language:
english
File:
PDF, 375 KB
english, 1993
6

Reversible simulation of space-bounded computations

Year:
1995
Language:
english
File:
PDF, 359 KB
english, 1995
7

Max NP-completeness made easy

Year:
1999
Language:
english
File:
PDF, 1.24 MB
english, 1999
8

Minimum-delay schedules in layered networks

Year:
1991
Language:
english
File:
PDF, 419 KB
english, 1991
9

Foreword

Year:
2009
Language:
english
File:
PDF, 115 KB
english, 2009
10

Parsimonious flooding in dynamic graphs

Year:
2011
Language:
english
File:
PDF, 284 KB
english, 2011
11

A uniform approach to define complexity classes

Year:
1992
Language:
english
File:
PDF, 1.37 MB
english, 1992
12

On Approximating a Scheduling Problem

Year:
2001
Language:
english
File:
PDF, 86 KB
english, 2001
15

Completeness in approximation classes

Year:
1991
Language:
english
File:
PDF, 1.06 MB
english, 1991
16

The futures of peace: A forum humanum project report

Year:
1988
Language:
english
File:
PDF, 651 KB
english, 1988
17

Structure in Approximation Classes

Year:
1999
Language:
english
File:
PDF, 478 KB
english, 1999
21

[Lecture Notes in Computer Science] Fun with Algorithms Volume 4475 ||

Year:
2007
Language:
english
File:
PDF, 5.56 MB
english, 2007
22

Foreword

Year:
2008
Language:
english
File:
PDF, 130 KB
english, 2008
40

Preface

Year:
2016
Language:
english
File:
PDF, 101 KB
english, 2016
43

How to find the best approximation results

Year:
1998
Language:
english
File:
PDF, 482 KB
english, 1998
49

Approximating the Temporal Neighbourhood Function of Large Temporal Graphs

Year:
2019
Language:
english
File:
PDF, 1.39 MB
english, 2019